package sword_to_1;

public class LeeCode_11 {
    public static void main(String[] args) {
        
    }
    private static int minArray(int[] numbers) {
        int n = numbers.length;
        if (n == 1){
            return numbers[0];
        }
        for (int i = 1; i < n; i++) {
            if (numbers[i] < numbers[i - 1]){
                return numbers[i];
            }
        }
        return numbers[0];
    }
}
